منابع مشابه
Operational and Denotational Semantics for the Box Algebra
This paper describes general theory underpinning the operational semantics and the denota-tional Petri net semantics of the box algebra including recursion. For the operational semantics, inductive rules for process expressions are given. For the net semantics, a general mechanism of re-nement and relabelling is introduced, using which the connectives of the algebra are deened. The paper also d...
متن کاملA Denotational Semantics of Real-Time Process Algebra (RTPA)
Real-time process algebra (RTPA) is a form of denotational mathematics for dealing with fundamental system behaviors such as timing, interrupt, concurrency, and event/time/interrupt-driven system dispatching. Because some key RTPA processes cannot be described adequately in conventional denotational semantic paradigms, a new framework for modeling time and processes is sought in order to repres...
متن کاملA Denotational Semantics for Circus
Circus specifications define both data and behavioural aspects of systems using a combination of Z and CSP. Previously, a denotational semantics has been given to Circus; however, as a shallow embedding of Circus in Z, it was not possible to use it to prove properties like the refinement laws that justify the distinguishing development technique associated with Circus. This work presents a fina...
متن کاملA Denotational Semantics for Curry
We aim to build a denotational semantics for the functional logic programming language Curry, to be used for parametricity and logical relation arguments. First, we investigate only a subset of Curry, but include the important features that separate Curry from a just functional language. We compare a poweralgebraic and a multialgebraic semantic approach and motivate our decision for the multial...
متن کاملA Denotational Semantics for Prolog
analysis is nite, which was not the case in our previous proposal [13]. The overheadneeded for reaching an improved precision essentially consists in the use of observability andkernel constraints and of their success and failure conditions.We can now consider the already mentioned paper [11]. A big di erence arises lookingfor instance at the way they handle clause composition a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Logic and Algebraic Programming
سال: 2008
ISSN: 1567-8326
DOI: 10.1016/j.jlap.2007.05.002